0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.12/0.34	% Computer : n009.cluster.edu
0.12/0.34	% Model    : x86_64 x86_64
0.12/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory   : 8042.1875MB
0.12/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1920
0.12/0.34	% WCLimit    : 240
0.12/0.34	% DateTime   : Wed Jul 30 09:02:04 EDT 2025
0.12/0.34	% CPUTime    : 
0.20/0.48	Running higher-order theorem proving
2.34/2.52	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.S4Esbkm3R1/E---3.1_2061.p
6.21/3.89	# Version: 3.0.0-ho
6.21/3.89	# partial match(2): HMLMSMSMSSLCHFA
6.21/3.89	# Preprocessing class: HMLLSMLMSSLCHFA.
6.21/3.89	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
6.21/3.89	# Starting new_ho_10 with 1200s (5) cores
6.21/3.89	# Starting sh5l with 240s (1) cores
6.21/3.89	# Starting new_bool_1 with 240s (1) cores
6.21/3.89	# Starting new_bool_2 with 240s (1) cores
6.21/3.89	# new_bool_2 with pid 2143 completed with status 0
6.21/3.89	# Result found by new_bool_2
6.21/3.89	# partial match(2): HMLMSMSMSSLCHFA
6.21/3.89	# Preprocessing class: HMLLSMLMSSLCHFA.
6.21/3.89	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
6.21/3.89	# Starting new_ho_10 with 1200s (5) cores
6.21/3.89	# Starting sh5l with 240s (1) cores
6.21/3.89	# Starting new_bool_1 with 240s (1) cores
6.21/3.89	# Starting new_bool_2 with 240s (1) cores
6.21/3.89	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
6.21/3.89	# Search class: HGHSM-SMLM32-DHFFFSBN
6.21/3.89	# Scheduled 5 strats onto 1 cores with 240 seconds (240 total)
6.21/3.89	# Starting new_ho_10 with 145s (1) cores
6.21/3.89	# new_ho_10 with pid 2144 completed with status 0
6.21/3.89	# Result found by new_ho_10
6.21/3.89	# partial match(2): HMLMSMSMSSLCHFA
6.21/3.89	# Preprocessing class: HMLLSMLMSSLCHFA.
6.21/3.89	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
6.21/3.89	# Starting new_ho_10 with 1200s (5) cores
6.21/3.89	# Starting sh5l with 240s (1) cores
6.21/3.89	# Starting new_bool_1 with 240s (1) cores
6.21/3.89	# Starting new_bool_2 with 240s (1) cores
6.21/3.89	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
6.21/3.89	# Search class: HGHSM-SMLM32-DHFFFSBN
6.21/3.89	# Scheduled 5 strats onto 1 cores with 240 seconds (240 total)
6.21/3.89	# Starting new_ho_10 with 145s (1) cores
6.21/3.89	# Preprocessing time       : 0.150 s
6.21/3.89	# Presaturation interreduction done
6.21/3.89	
6.21/3.89	# Proof found!
6.21/3.89	# SZS status Theorem
6.21/3.89	# SZS output start CNFRefutation
6.21/3.89	thf(decl_sort1, type, nat: $tType).
6.21/3.89	thf(decl_sort2, type, list_VEBT_VEBT: $tType).
6.21/3.89	thf(decl_sort3, type, vEBT_VEBT: $tType).
6.21/3.89	thf(decl_507, type, list_u1324408373059187874T_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT > list_VEBT_VEBT).
6.21/3.89	thf(decl_540, type, nth_VEBT_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT).
6.21/3.89	thf(decl_1059, type, vEBT_V8194947554948674370ptions: vEBT_VEBT > nat > $o).
6.21/3.89	thf(decl_1062, type, vEBT_VEBT_high: nat > nat > nat).
6.21/3.89	thf(decl_1064, type, vEBT_VEBT_low: nat > nat > nat).
6.21/3.89	thf(decl_1075, type, vEBT_vebt_insert: vEBT_VEBT > nat > vEBT_VEBT).
6.21/3.89	thf(decl_1136, type, i: nat).
6.21/3.89	thf(decl_1140, type, na: nat).
6.21/3.89	thf(decl_1142, type, treeList: list_VEBT_VEBT).
6.21/3.89	thf(decl_1143, type, xa: nat).
6.21/3.89	thf(conj_0, conjecture, ?[X1593:nat]:((vEBT_V8194947554948674370ptions @ (nth_VEBT_VEBT @ (list_u1324408373059187874T_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na) @ (vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na)) @ (vEBT_VEBT_low @ xa @ na))) @ i) @ X1593)), file('/export/starexec/sandbox2/tmp/tmp.S4Esbkm3R1/E---3.1_2061.p', conj_0)).
6.21/3.89	thf(fact_0_True, axiom, ((i)=(vEBT_VEBT_high @ xa @ na)), file('/export/starexec/sandbox2/tmp/tmp.S4Esbkm3R1/E---3.1_2061.p', fact_0_True)).
6.21/3.89	thf(fact_3__C164_C, axiom, ((nth_VEBT_VEBT @ (list_u1324408373059187874T_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na) @ (vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na)) @ (vEBT_VEBT_low @ xa @ na))) @ i)=(vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na)) @ (vEBT_VEBT_low @ xa @ na))), file('/export/starexec/sandbox2/tmp/tmp.S4Esbkm3R1/E---3.1_2061.p', fact_3__C164_C)).
6.21/3.89	thf(fact_1__C166_C, axiom, (vEBT_V8194947554948674370ptions @ (vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na)) @ (vEBT_VEBT_low @ xa @ na)) @ (vEBT_VEBT_low @ xa @ na)), file('/export/starexec/sandbox2/tmp/tmp.S4Esbkm3R1/E---3.1_2061.p', fact_1__C166_C)).
6.21/3.89	thf(c_0_4, negated_conjecture, ~(?[X1593:nat]:((vEBT_V8194947554948674370ptions @ (nth_VEBT_VEBT @ (list_u1324408373059187874T_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na) @ (vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na)) @ (vEBT_VEBT_low @ xa @ na))) @ i) @ X1593))), inference(assume_negation,[status(cth)],[conj_0])).
6.21/3.89	thf(c_0_5, negated_conjecture, ![X20805:nat]:(~(vEBT_V8194947554948674370ptions @ (nth_VEBT_VEBT @ (list_u1324408373059187874T_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na) @ (vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na)) @ (vEBT_VEBT_low @ xa @ na))) @ i) @ X20805)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])).
6.21/3.89	thf(c_0_6, negated_conjecture, ![X2:nat]:(~((vEBT_V8194947554948674370ptions @ (nth_VEBT_VEBT @ (list_u1324408373059187874T_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na) @ (vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na)) @ (vEBT_VEBT_low @ xa @ na))) @ i) @ X2))), inference(split_conjunct,[status(thm)],[c_0_5])).
6.21/3.89	thf(c_0_7, plain, ((i)=(vEBT_VEBT_high @ xa @ na)), inference(split_conjunct,[status(thm)],[fact_0_True])).
6.21/3.89	thf(c_0_8, plain, ((nth_VEBT_VEBT @ (list_u1324408373059187874T_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na) @ (vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na)) @ (vEBT_VEBT_low @ xa @ na))) @ i)=(vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na)) @ (vEBT_VEBT_low @ xa @ na))), inference(split_conjunct,[status(thm)],[fact_3__C164_C])).
6.21/3.89	thf(c_0_9, plain, (vEBT_V8194947554948674370ptions @ (vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ (vEBT_VEBT_high @ xa @ na)) @ (vEBT_VEBT_low @ xa @ na)) @ (vEBT_VEBT_low @ xa @ na)), inference(split_conjunct,[status(thm)],[fact_1__C166_C])).
6.21/3.89	thf(c_0_10, negated_conjecture, ![X2:nat]:(~((vEBT_V8194947554948674370ptions @ (nth_VEBT_VEBT @ (list_u1324408373059187874T_VEBT @ treeList @ i @ (vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ i) @ (vEBT_VEBT_low @ xa @ na))) @ i) @ X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6, c_0_7]), c_0_7])).
6.21/3.89	thf(c_0_11, plain, ((nth_VEBT_VEBT @ (list_u1324408373059187874T_VEBT @ treeList @ i @ (vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ i) @ (vEBT_VEBT_low @ xa @ na))) @ i)=(vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ i) @ (vEBT_VEBT_low @ xa @ na))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_7]), c_0_7]), c_0_7])).
6.21/3.89	thf(c_0_12, plain, (vEBT_V8194947554948674370ptions @ (vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ i) @ (vEBT_VEBT_low @ xa @ na)) @ (vEBT_VEBT_low @ xa @ na)), inference(rw,[status(thm)],[c_0_9, c_0_7])).
6.21/3.89	thf(c_0_13, negated_conjecture, ![X2:nat]:(~((vEBT_V8194947554948674370ptions @ (vEBT_vebt_insert @ (nth_VEBT_VEBT @ treeList @ i) @ (vEBT_VEBT_low @ xa @ na)) @ X2))), inference(rw,[status(thm)],[c_0_10, c_0_11])).
6.21/3.89	thf(c_0_14, plain, ($false), inference(sr,[status(thm)],[c_0_12, c_0_13]), ['proof']).
6.21/3.89	# SZS output end CNFRefutation
6.21/3.89	# Parsed axioms                        : 10382
6.21/3.89	# Removed by relevancy pruning/SinE    : 8298
6.21/3.89	# Initial clauses                      : 6346
6.21/3.89	# Removed in clause preprocessing      : 1815
6.21/3.89	# Initial clauses in saturation        : 4531
6.21/3.89	# Processed clauses                    : 81
6.21/3.89	# ...of these trivial                  : 6
6.21/3.89	# ...subsumed                          : 24
6.21/3.89	# ...remaining for further processing  : 51
6.21/3.89	# Other redundant clauses eliminated   : 3
6.21/3.89	# Clauses deleted for lack of memory   : 0
6.21/3.89	# Backward-subsumed                    : 3
6.21/3.89	# Backward-rewritten                   : 1
6.21/3.89	# Generated clauses                    : 4
6.21/3.89	# ...of the previous two non-redundant : 1
6.21/3.89	# ...aggressively subsumed             : 0
6.21/3.89	# Contextual simplify-reflections      : 0
6.21/3.89	# Paramodulations                      : 0
6.21/3.89	# Factorizations                       : 0
6.21/3.89	# NegExts                              : 0
6.21/3.89	# Equation resolutions                 : 3
6.21/3.89	# Disequality decompositions           : 0
6.21/3.89	# Total rewrite steps                  : 21
6.21/3.89	# ...of those cached                   : 10
6.21/3.89	# Propositional unsat checks           : 0
6.21/3.89	#    Propositional check models        : 0
6.21/3.89	#    Propositional check unsatisfiable : 0
6.21/3.89	#    Propositional clauses             : 0
6.21/3.89	#    Propositional clauses after purity: 0
6.21/3.89	#    Propositional unsat core size     : 0
6.21/3.89	#    Propositional preprocessing time  : 0.000
6.21/3.89	#    Propositional encoding time       : 0.000
6.21/3.89	#    Propositional solver time         : 0.000
6.21/3.89	#    Success case prop preproc time    : 0.000
6.21/3.89	#    Success case prop encoding time   : 0.000
6.21/3.89	#    Success case prop solver time     : 0.000
6.21/3.89	# Current number of processed clauses  : 43
6.21/3.89	#    Positive orientable unit clauses  : 19
6.21/3.89	#    Positive unorientable unit clauses: 0
6.21/3.89	#    Negative unit clauses             : 24
6.21/3.89	#    Non-unit-clauses                  : 0
6.21/3.89	# Current number of unprocessed clauses: 4451
6.21/3.89	# ...number of literals in the above   : 18584
6.21/3.89	# Current number of archived formulas  : 0
6.21/3.89	# Current number of archived clauses   : 5
6.21/3.89	# Clause-clause subsumption calls (NU) : 0
6.21/3.89	# Rec. Clause-clause subsumption calls : 0
6.21/3.89	# Non-unit clause-clause subsumptions  : 0
6.21/3.89	# Unit Clause-clause subsumption calls : 143
6.21/3.89	# Rewrite failures with RHS unbound    : 0
6.21/3.89	# BW rewrite match attempts            : 1
6.21/3.89	# BW rewrite match successes           : 1
6.21/3.89	# Condensation attempts                : 81
6.21/3.89	# Condensation successes               : 0
6.21/3.89	# Termbank termtop insertions          : 564798
6.21/3.89	# Search garbage collected termcells   : 153935
6.21/3.89	
6.21/3.89	# -------------------------------------------------
6.21/3.89	# User time                : 0.753 s
6.21/3.89	# System time              : 0.068 s
6.21/3.89	# Total time               : 0.821 s
6.21/3.89	# Maximum resident set size: 36336 pages
6.21/3.89	
6.21/3.89	# -------------------------------------------------
6.21/3.89	# User time                : 1.250 s
6.21/3.89	# System time              : 0.094 s
6.21/3.89	# Total time               : 1.344 s
6.21/3.89	# Maximum resident set size: 24348 pages
6.21/3.89	% E exiting
6.21/3.89	% E exiting
6.21/3.89	EOF